Coverage with k-Transmitters in the Presence of Obstacles
نویسندگان
چکیده
For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.
منابع مشابه
Coverage with Transmitters in the Presence of Obstacles
For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary, and sometimes sufficient, to cover a given collection of line segments, polygonal chains and polygons.
متن کاملCOMPUTING BEST COVERAGE PATH IN THE PRESENCE OF OBSTACLES IN WIRELESS SENSOR NETWORKS by
COMPUTING BEST COVERAGE PATH IN THE PRESENCE OF OBSTACLES IN WIRELESS SENSOR NETWORKS
متن کاملCentralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles
This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...
متن کاملInfluence of insertion of holes in the middle of obstacles on the flow around a surface-mounted cube
The aim of our study is to analyze the impact of insertion holes in the middle of obstacles on the flow around a surface-mounted cube, In order to do this; we studied four configurations of obstacles in a channel with a Reynods number based on obstacle height ReH = 40000. The hexahedral structured meshes were used to solve the fluid dynamics equations .The finite volume method are employed to s...
متن کاملComputing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP (s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line segment obstacles and n point sensors on the plane. For any path between s to t, p is the least protected point along the path such that the Euclidean distance between p and its closest sensor is maximum. This distance (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010